Limit Laws of Erdos - Renyi - Shepp Type
نویسنده
چکیده
Tn = max1_< 0 is a given constant . We assume that the random variables X i are centered and have a finite moment generating function in a right neighborhood of zero, and obtain among other results the full form of the Erdos-Renyi (1970) and Shepp (1964) theorems . Our conditions extend those of Deheuvels, Devroye and Lynch (1986) to cover a larger class of distributions .
منابع مشابه
A local central limit theorem for triangles in a random graph
In this paper, we prove a local limit theorem for the distribution of the number of triangles in the Erdos-Renyi random graph G(n, p), where p ∈ (0, 1) is a fixed constant. Our proof is based on bounding the characteristic function ψ(t) of the number of triangles, and uses several different conditioning arguments for handling different ranges of t.
متن کاملHandout: Power Laws and Preferential Attachment
Empirical studies of real world networks revealed that degree distribution often follows a heavytailed distribution, a power law. At that time, there were two kinds of network models: the Erdos-Renyi random graph Gn,p and the Small World graphs of Watts and Strogatz. In both models the degrees were very close to the mean degree and there was little variation. Thus, there was the question of fin...
متن کاملHandout: Power Laws and Preferential Attachment
Empirical studies of real world networks revealed that degree distribution often follows a heavytailed distribution, a power law. At that time, there were two kinds of network models: the Erdos-Renyi random graph Gn,p and the Small World graphs of Watts and Strogatz. In both models the degrees were very close to the mean degree and there was little variation. Thus, there was the question of fin...
متن کاملLocal Large deviations for empirical locality measure of typed Random Graph Models
Abstract. In this article, we prove a local large deviation principle (LLDP) for the empirical locality measure of typed random networks on n nodes conditioned to have a given empirical type measure and empirical link measure. From the LLDP, we deduce a full large deviation principle for the typed random graph, and the classical Erdos-Renyi graphs, where nc/2 links are inserted at random among ...
متن کاملAn Erdos - Rhyi taw with Shifts RICHARD
Motivated by the comparison of DNA sequences, a generalization is given of the result of Erdos and Renyi on the length R, of the longest run of heads in the first n tosses of a coin. Suppose that all the " letters " are independent and identically distributed. The length of the longest match without shifts has the same distribution as R, , the length of the longest head run for a biased coin wi...
متن کامل